Optimal paths in networks with rated transition time costs
نویسندگان
چکیده
In this paper we formulate and study an optimal path problem on networks that extends the minimum cost path problem in the weighted directed graphs. Let G = (X,E) be a finite directed graph with vertex set X, |X| = n and edge set E where to each directed edge e = (u, v) ∈ E a cost ce is associated. Assume that for two given vertices x, y there exists a directed path P (x, y) = {x = x0, e0, x1, e1, x2, e2, . . . , xk = y} from x to y. For this directed path we define the total rated cost
منابع مشابه
Optimal design of cross docking supply chain networks with time-varying uncertain demands
This paper proposes an integrated network design model for a post-distribution cross-docking strategy, comprising multi product production facilities with shared production resources, capacitated cross docks with setup cost and customer zones with time windows constraints. The model is dynamic in terms of time-varying uncertain demands, whereas uncertainty is expressed with scenario approach an...
متن کاملOptimal Capacitor Allocation in Radial Distribution Networks for Annual Costs Minimization Using Hybrid PSO and Sequential Power Loss Index Based Method
In the most recent heuristic methods, the high potential buses for capacitor placement are initially identified and ranked using loss sensitivity factors (LSFs) or power loss index (PLI). These factors or indices help to reduce the search space of the optimization procedure, but they may not always indicate the appropriate placement of capacitors. This paper proposes an efficient approach for t...
متن کاملA Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks
The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...
متن کاملWeighted Optimal Path in Graph with Multiple Indexes
This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...
متن کاملLong-term Planning of Optimal Placement of Distribution Transformers to Improve Reliability and Power Quality with the Approach of Reducing Costs and Losses
One of the most critical and complex issues in long-term planning of distribution networks is the optimal placement of distribution transformers. In this paper, the optimal placement of distribution transformers was investigated based on a complete and multi-objective function. In the proposed method, location, optimal capacity, and the service area are determined by minimizing costs (investmen...
متن کامل